Approximating the Minimum Strongly Connected Subgraph via a
نویسنده
چکیده
Lower Bound. Adrian Vetta Abstract We present a 32 -approximation algorithm for the problem of nding a minimum strongly connected spanning subgraph in a given directed graph. As a corollary we obtain a 3 2 -approximation algorithm for the more general minimum equivalent digraph problem. The performance of our algorithm is measured against a lower bound obtained from a simple matching problem. The performance guarantee is optimal with respect to the lower bound.
منابع مشابه
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Abstract An e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V E There are four versions of the problem and the approximation guarantees are as followsAn e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V ...
متن کاملApproximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract)
An efficient heuristic is presented for the problem of finding a minimum-size kconnected spanning subgraph of an (undirected or directed) simple graph G = (V,E). There are four versions of the problem, and the approximation guarantees are as follows: • minimum-size k-node connected spanning subgraph of an undirected graph 1 + [1/k], • minimum-size k-node connected spanning subgraph of a directe...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملA 17/12-approximation algorithm for 2-vertex-connected spanning subgraphs on graphs with minimum degree at least 3
We obtain a polynomial-time 17 12 -approximation algorithm for the minimum-cost 2-vertexconnected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for finding the smallest 2-edge-connected spanning subgraph by Cheriyan, Sebo and Szi...
متن کاملApproximating Connected Safe Sets in Weighted Trees
For a graph G and a non-negative integral weight function w on the vertex set of G, a set S of vertices of G is w-safe if w(C) ≥ w(D) for every component C of the subgraph of G induced by S and every component D of the subgraph of G induced by the complement of S such that some vertex in C is adjacent to some vertex of D. The minimum weight w(S) of a w-safe set S is the safe number s(G,w) of th...
متن کامل